Transitive closures and orderings on soft sets
نویسندگان
چکیده
منابع مشابه
On transitive soft sets over semihypergroups
The aim of this paper is to initiate and investigate new soft sets over semihypergroups, named special soft sets and transitive soft sets and denoted by $S_{H}$ and $T_{H},$ respectively. It is shown that $T_{H}=S_{H}$ if and only if $beta=beta^{*}.$ We also introduce the derived semihypergroup from a special soft set and study some properties of this class of semihypergroups.
متن کاملon transitive soft sets over semihypergroups
the aim of this paper is to initiate and investigate new soft sets over semihypergroups, named special soft sets and transitive soft sets and denoted by $s_{h}$ and $t_{h},$ respectively. it is shown that $t_{h}=s_{h}$ if and only if $beta=beta^{*}.$ we also introduce the derived semihypergroup from a special soft set and study some properties of this class of semihypergroups.
متن کاملOn Transitive Soft Sets over Semihypergroups
The aim of this paper is to initiate and investigate new soft sets over semihypergroups, named special soft sets and transitive soft sets and denoted by SH and TH , respectively. It is shown that TH = SH if and only if β = β ∗. We also introduce the derived semihypergroup from a special soft set and study some properties of this class of semihypergroups.
متن کاملSome New Results on Orderings on Soft Sets
Molodtsov [2] introduced the soft set theory. Moreover Babitha and Sunil [5], [6] introduced partially ordered soft set. In this study we improve orderings on soft sets by giving new definitions such as filtered soft set, soft lattice, complete soft lattice, and some results related these definitions are studied.
متن کاملExecutable Transitive Closures
We provide a generic work-list algorithm to compute the (reflexive-)transitive closure of relations where only successors of newly detected states are generated. In contrast to our previous work [2], the relations do not have to be finite, but each element must only have finitely many (indirect) successors. Moreover, a subsumption relation can be used instead of pure equality. An executable var...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2011
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2011.07.010